Parallel Dynamic Programming using Data - Parallel Skeletons ∗
نویسندگان
چکیده
For demonstrating the powerfulness of skeletal programming we have developed a parallelization technique toward one class of optimization problems called maximum marking problems, which can be recognized as one class of dynamic programming. This paper, as in the course of an ongoing research, focuses on problems of dynamic programming in general, and examines how the skeletal approach successfully parallelizes problems of dynamic programming.
منابع مشابه
Parallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملAlgorithmic Skeletons for Adaptive Multigrid Methods
This paper presents a new approach to parallel programming with algorithmic skeletons, i.e. common parallelization patterns. We use an imperative language enhanced by some functional features as host for the embedding of the skeletons. This allows an eecient implementation and at the same time a high level of programming. In particular, low level communication problems such as deadlocks are avo...
متن کاملeskimo: Experimenting with Skeletons in the Shared Address Model
We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the eskimo library which represents an attempt to merge the ...
متن کاملeskimo: EXPERIMENTING WITH SKELETONS
We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the eskimo library which represents an attempt to merge the ...
متن کامل